Machine discovery of effective admissible heuristics

Mechanical Generation of Admissible Heuristics

Admissible Heuristics for Automated Planning

The problem of domain-independent automated planning has been a topic of research in Artificial Intelligence since the very beginnings of the field. Due to the desire not to rely on vast quantities of problem specific knowledge, the most widely adopted approach to automated planning is search. The topic of this thesis is the development of methods for achieving effective search control for doma...

Admissible Heuristics for Optimal Planning

tlSP ~tm[ HSPr iLrt~ two r(’¢’Pllt p].allllors th~tt st.,trch th," statt~-Sl);.’," 1tsiltg i).lt heuristic fl|n,’tiolt (’xtt’act,’,l froill Strips cnt’tMiatgs, liSP dot’s a f(,rward s(mrch frtmt the ialt.bd stlttt, rt:vc,tuputiltg tim Imuristic in vv(.ry static. whih: HSPr tit)its a l’t:grt.ssit,u s(.~Lr0’h fl’cJm th(. g0,:tl t’,,utpuling ~t .-uitalth. r(.prv.~vtttati,)u -f th(. h,.,trim.it .nl...

Specialization of Admissible Path-finding Heuristics

Automatic program generation using logic programming can be used to improve existing problem solving programs. An important class of problems in AI are optimal path-finding problems. These problems are usually solved using the IDA* algorithm with an admissible heuristic. An heuristic is admissible if it never overestimates the cost of solving a problem. An admissible heuristic is better than an...

Learning Admissible Heuristics while Solving Problems

A method is presented that causes A* to return high quality solutions whi le solving a set of problems using a non-admissible heuristic. The heuristic gu id ing the search changes as new informat ion is learned dur ing the search, and it converges to an admissible heuristic wh ich 'contains the insight ' of the or ig ina l nonadmissible one. After a finite number of problems, A * returns only o...